منابع مشابه
Another Year for CFG
Overall, it has been a good year for CFG, with some excellent research papers, and interesting collections of reviews in our special 'Ontologies' issue, the extended coverage of the Plant and Animal Genomes Conference, and the special sections from the ESF Structural Genomics workshop and the ESF Functional Genomics and Disease 2003 Conference. In fact, such is the demand for page space in CFG ...
متن کاملGoodbye to CFG
Sadly, I am writing this Editorial to let you know of our decision to close Comparative and Functional Genomics as of this issue. Unfortunately, despite much hard work by the entire Editorial Board and the team at Wiley, CFG has not achieved what we had hoped and we feel that no amount of effort will be enough to rectify this. This will be the final issue of the journal. However, its archive wi...
متن کاملA Method for Accelerating CFG -
This paper describes an algorithm for accelerating the CFG-parsing process by using dependency (or modiier-modiiee relationship) information given by, for instance, dependency estimation programs such as stochastic parsers, user's indication in an interactive application, and linguistic annotations added in a source text. This is a method for enhancing existing grammar-based CFG-parsing system ...
متن کاملCFG and the New Year
This New Year, the ®rst of the New Millennium, sees an important landmark in the development of Comparative and Functional Genomics (CFG). CFG is no longer a specialised section of Yeast, but is now a journal in its own right (or is that write?). Yeast subscribers should not fear, they will continue to receive complimentary copies of CFG throughout 2001. What it does mean is that CFG will recei...
متن کاملProbabilistic CFG with Latent Annotations
This paper defines a generative probabilistic model of parse trees, which we call PCFG-LA. This model is an extension of PCFG in which non-terminal symbols are augmented with latent variables. Finegrained CFG rules are automatically induced from a parsed corpus by training a PCFG-LA model using an EM-algorithm. Because exact parsing with a PCFG-LA is NP-hard, several approximations are describe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Letters of Rzeszow University of Technology - Mechanics
سال: 2017
ISSN: 0209-2689,2300-5211
DOI: 10.7862/rm.2017.38